Algorithmic Problems in Amalgams of Finite Groups: Conjugacy and Intersection
نویسنده
چکیده
Geometric methods proposed by Stallings [46] for treating finitely generated subgroups of free groups were successfully used to solve a wide collection of decision problems for free groups and their subgroups [3, 19, 29, 30, 36, 41, 49]. In the present paper we employ the generalized Stallings’ methods, developed by the author in [32], to solve various algorithmic problems concerning finitely generated subgroups of amalgams of finite groups.
منابع مشابه
Algorithmic Problems in Amalgams of Finite Groups
Geometric methods proposed by Stallings [53] for treating finitely generated subgroups of free groups were successfully used to solve a wide collection of decision problems for free groups and their subgroups [4, 25, 37, 38, 43, 48, 56]. It turns out that Stallings’ methods can be effectively generalized for the class of amalgams of finite groups [39]. In the present paper we employ subgroup gr...
متن کاملFINITE GROUPS WITH FIVE NON-CENTRAL CONJUGACY CLASSES
Let G be a finite group and Z(G) be the center of G. For a subset A of G, we define kG(A), the number of conjugacy classes of G that intersect A non-trivially. In this paper, we verify the structure of all finite groups G which satisfy the property kG(G-Z(G))=5, and classify them.
متن کاملOn the Regular Power Graph on the Conjugacy Classes of Finite Groups
emph{The (undirected) power graph on the conjugacy classes} $mathcal{P_C}(G)$ of a group $G$ is a simple graph in which the vertices are the conjugacy classes of $G$ and two distinct vertices $C$ and $C'$ are adjacent in $mathcal{P_C}(G)$ if one is a subset of a power of the other. In this paper, we describe groups whose associated graphs are $k$-regular for $k=5,6$.
متن کاملSome connections between powers of conjugacy classes and degrees of irreducible characters in solvable groups
Let $G$ be a finite group. We say that the derived covering number of $G$ is finite if and only if there exists a positive integer $n$ such that $C^n=G'$ for all non-central conjugacy classes $C$ of $G$. In this paper we characterize solvable groups $G$ in which the derived covering number is finite.
متن کاملGroup amalgams of index (4, 2) and 4-valent 2-arc-transitive graphs
A finite group amalgam of index (k,m) is a 5-tuple (L,φ,B, ψ,R) where L, B, and R are finite groups, φ : B → L and ψ : B → R are monomorphisms, and the indices of B and B in L and R are k and m, respectively. The amalgam is faithful if N ≤ B, N C L, and N C R implies N = 1. It is well known that the finite faithful amalgams of index (k, 2) are in a bijective correspondence with (the conjugacy c...
متن کامل